Short Covering Trades

Complementarities in Information Acquisition with Short-Term Trades

In a financial market where agents trade for prices in the short-term and where news can increase the uncertainty of the public belief, there are strategic complementarities in the acquisition of private information and a continuum of equilibrium strategies if the cost of information is sufficient small. Imperfect observation of the past prices reduces the continuum of Nash-equilibrium to a uni...

Long and short covering edges in combination logic circuits

Absrracr-This paper extends the polynominal time algorithm obtained in [7] to find a minimal cardinality path set that long covers each lead or gate input of a digital logic circuit. The extension of this paper allows one to find, in polynominal time, a minimal cardinality path set that both long and short covers these leads or gate inputs.

A Short Note on the Probabilistic Set Covering Problem

In this paper we address the following probabilistic version (PSC) of the set covering problem: min{cx | P(Ax ≥ ξ) ≥ p, xj ∈ {0, 1} j ∈ N} where A is a 0-1 matrix, ξ is a random 0-1 vector and p ∈ (0, 1] is the threshold probability level. In a recent development Saxena, Goyal and Lejeune proposed a MIP reformulation of (PSC) and reported extensive computational results with small and medium si...

Short covering codes arising from matchings in weighted graphs

The concept of embedded matching in a weighted graph is introduced, and the maximum cardinality of an embedded matching is computed. On the other hand, consider the following problem induced by a short covering. Given a prime power q, the number c(q) denotes the minimum cardinality of a subset H of Fq which satisfies the following property: every element in this space differs in at most 1 coord...

4-homogeneous Latin Trades